Optimal bit allocation and best-basis selection for wavelet packets and TSVQ

نویسندگان

  • Jill R. Goldschneider
  • Eve A. Riskin
چکیده

To use wavelet packets for lossy data compression, the following issues must be addressed: quantization of the wavelet subbands, allocation of bits to each subband, and best-basis selection. We present an algorithm for wavelet packets that systematically identifies all bit allocations/best-basis selections on the lower convex hull of the rate-distortion curve. We demonstrate the algorithm on tree-structured vector quantizers used to code image subbands from the wavelet packet decomposition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint optimal bit allocation and best-basis selection for wavelet packet trees

In this paper, an algorithm for wavelet packet trees that can systematically identify all bit allocations/best-basis selections on the lower convex hull of the rate-distortion curve is presented. The algorithm is applied to tree-structured vector quantizers used to code image subbands that result from the wavelet packet decomposition. This method is compared to optimal bit allocation for the di...

متن کامل

Bit allocation via recursive optimal pruning with applications to wavelet/VQ image compression

We address the problem of bit allocation to wavelet subbands by extending the Recursive Optimal Pruning algorithm of Kiang, Baker, Sullivan and Chiu to do bit allocation. We apply the algorithm to tree-structured vector quantizers used to code image subbands that result from the wavelet decomposition. We compare this method to GBFOS bit allocation and show that it produces many additional bit a...

متن کامل

Simultaneous noise reduction and SAR image data compression using best wavelet packet basis

We propose a novel method for simultaneous noise reduction and data compression based on shrinking, quantizing and coding the wavelet packet (WP) coeecients. A dynamic programming and fast pruning algorithm is used to eeciently choose the best basis from the entire library of admissible WP bases, and jointly optimize the bit allocation strategy and the quantization scheme in the rate-distortion...

متن کامل

Shape Representation via Best Orthogonal Basis Selection

We formulate the problem of finding a statistical representation of shape as a best basis selection problem in which the goal is to choose the basis for optimal shape representation from a very large library of bases. In this work, our emphasis is on applying this basis selection framework using the wavelet packets library to estimate the probability density function of a class of shapes from a...

متن کامل

Fast adaptive wavelet packets using interscale embedding of decomposition structures

0167-8655/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.patrec.2010.04.016 * Corresponding author. Tel.: +86 10 62788613x810 E-mail addresses: [email protected] edu.cn (W. Xu), [email protected] (Q. Dai). The most widely used basis selection algorithm for adaptive wavelet packets is the optimal basis selection method, which first grows a full wavelet packet tree and then...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 8 9  شماره 

صفحات  -

تاریخ انتشار 1999